Decomposing Linear Control Allocation Problems

A strategy for decomposing a class of constrained linear control allocation problems is considered. The actuators are partitioned into groups of mutually non-interacting actuators. The problem is then divided into a set of sub-problems and a master problem, whose solution approximates the solution to the original problem. For some classes of allocation problems the method is extended such that it also yields an optimal solution. The motivation behind the approach is to reduce the computational effort needed to find explicit solutions by obtaining sub-optimal solutions, increase possibilities of reconfigurable control allocation, and to provide a scheme that allows for a tradeoff between the drawbacks and benefits of the explicit solution to control allocation problems.